Soft Decision Decoding of a Fixed-rate Entropy-coded Trellis Quantizer over a Noisy Channel
نویسندگان
چکیده
This report presents some new techniques to improve the performance of a Fixedrate Entropy-coded Trellis Quantizer (FE-TCQ) in transmission over a noisy channel. In this respect, we rst present the optimal decoder for a Fixed-rate Entropy-coded Vector Quantizer (FEVQ). A trellis structure is used to model the set of possible codewords in the FEVQ and the Viterbi algorithm is subsequently applied to select the most likely path through this trellis. In order to add quantization packing gain to the FEVQ, we take advantage of a Trellis Coded Quantization (TCQ) scheme. To prevent the error propagation, it is necessary to use a block structure obtained through a truncation of the corresponding trellis. To perform this task in an e cient manner, we apply the idea of tail-biting to the trellis structure of the underlying TCQ. It is shown that the use of a tail-biting trellis signi cantly reduces the required block length with respect to some other possible alternatives known for trellis truncation. This results in a smaller delay and also mitigates the e ect of the error propagation in signaling over a noisy channel. Finally, we present methods and numerical results for the combination of the proposed FEVQ soft decoder and a tail-biting TCQ. These results show that by an appropriate design of the underlying components, one can obtain a substantial improvement in the overall performance of such a xed-rate entropy-coded scheme. keywords Fixed-rate Entropy-coded Vector Quantization, Combined Source and Channel Coding Error Propagation
منابع مشابه
Soft Decision Decoding of Fixed-rat Entropy-code Trellis Coded Quantization over a Noisy Channel
This paper presents new techniques to improve the performance of a Fixed-rate Entropy-coded Trellis Coded Quantizer (FE-TCQ) in transmission over a noisy channel. In this respect, we first present the optimal decoder for a Fixed-rate Entropy-coded Vector Quantizer (FEVQ). We show that the optimal decoder of the FEVQ can be a maximum likelihood decoder while a trellis structure is used to model ...
متن کاملSoft Decision Decoding of Fixed Rate Entropy Constrained Quantizer over a Noisy Channel
Variable-length codes (e.g. Huuman codes) are commonly employed to minimize the average binary code-word length in the quantization of discrete sources. However , the eeect of error propagation limits the usefulness of variable length codes for the transmission over noisy channels. To avoid this shortcoming, one can use a xed-rate entropy constrained quantizer, limiting the propagation of error...
متن کاملLattice/Trellis based Fixed-rate Entropy-constrained Quantization
The fixed-rate entropy-constrained vector quantizer draws its motivation from the large gap in the performance of the optimal entropy-constrained scalar quantizer (ESCQ) and the fixed-rate LMQ for most non-uniform sources and tries to bridge this gap while maintaining a fixed-rate output. Having a fixed-rate output avoids all problems associated with a variable rate output such as error propaga...
متن کاملUniform trellis coded quantization for image transmission over noisy channels
A combined source/channel coding scheme without explicit error protection is proposed to transmit images through binary noisy channels. Unlike the error protection with re-transmission scheme and error concealment scheme by inserting synchronization codewords to entropy-coded bitstream, the proposed coding scheme employs transform coding, "xed-rate uniform threshold trellis coded quantization (...
متن کاملComparison between Soft and Hard Decision Decoding using Quaternary Convolutional Encoders and the Decomposed CPM Model
A generic M-ary continuous phase modulation (CPM) scheme, with a modulation index of h = 1/M, can be decomposed into a continuous-phase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is linear over the ring of integers modulo M. By using a channel encoder (CE), which is a convolutional encoder, to operate over the same ring of integers modulo M, the CE and the CPE can be c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001